Combining Elimination Rules in Tree-Based Nearest Neighbor Search Algorithms
نویسندگان
چکیده
منابع مشابه
Some Improvements in Tree Based Nearest Neighbour Search Algorithms
Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. In this paper we are interested on tree based algorithms that only make use of the metric properties of the space. One of the most known and refereed method in this class was proposed by Fukunaga and Narendra in the 70’s. This algorithm uses a tree that is traversed on search time and uses some elimina...
متن کاملFast nearest-neighbor search algorithms based on approximation-elimination search
In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approximation}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of Euclidean distance. Previous algorithms based on these elimination rules are reviewed in the cont...
متن کاملTesting Some Improvements of the Fukunaga and Narendra's Fast Nearest Neighbour Search Algorithm in a Spelling Task
Nearest neighbour search is one of the most simple and used technique in Pattern Recognition. One of the most known fast nearest neighbour algorithms was proposed by Fukunaga and Narendra. The algorithm builds a tree in preprocess time that is traversed on search time using some elimination rules to avoid its full exploration. This paper tests two new types of improvements in a real data enviro...
متن کاملFuzzy Clustering Method for Content-based Indexing
E cient and accurate information retrieval is one of the main issues in multimedia databases. In content-based multimedia retrieval databases, contents or features of the database objects are used for retrieval. To retrieve similar database objects, we often perform a nearest-neighbor search. A nearest-neighbor search is used to retrieve similar database objects with features nearest to the que...
متن کاملA Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
A new fast nearest neighbor algorithm is described that uses principal component analysis to build an efficient search tree. At each node in the tree, the data set is partitioned along the direction of maximum variance. The search algorithm efficiently uses a depth-first search and a new elimination criterion. The new algorithm was compared to sixteen other fast nearest neighbor algorithms on t...
متن کامل